Parallel Vectoring Algorithm for Pattern Matching
نویسندگان
چکیده
The main aim of this study is to propose efficient algorithms for image template matching on parallel machines. To our knowledge there is no a template matching algorithm that converts the template image and all candidate blocks in the source image from two-dimensions into one-dimension. This study proposes a Template Matching Vectoring Algorithm (TMVA) that reduces the amount of data to be analyzed by transforming 2-D images into 1-D images. Moreover, to speed up the vectoring pattern matching algorithm this study implements it in parallel. Complexity analysis and experimental results demonstrate that the performance of the proposed algorithm is superior to the other basic template matching algorithms.
منابع مشابه
A Parallel NIDS Pattern Matching Engine and Its Implementation on Network Processor
At the heart of almost every modern Network Intrusion Detection System (NIDS), there is a pattern matching engine (PME). As pattern matching is the most time consuming operation in NIDS, it is highly desired to reduce the pattern matching time of each packet or flow. This paper proposed a parallel pattern matching algorithm based on Aho-Corasick (AC) algorithm and an efficient load balance poli...
متن کاملConstant-Time Randomized Parallel String Matching
Given a pattern string of length m for the string matching problem, we design an algorithm that computes deterministic samples of a suuciently long substring of the pattern in constant time. This problem used to be the bottleneck in the pattern preprocessing for one-and two-dimensional pattern matching. The best previous time bound was O(log 2 m= log log m). We use this algorithm to obtain the ...
متن کاملEfficient Two-Dimensional Parallel Pattern Matching with Scaling
Given a text and a pattern, the problem of pattern matching consists of determining all the positions of the text where the pattern occurs. When the text and the pattern are matrices, the matching is termed bidimensional. There are variations of this problem where we allow the matching using a somehow modified pattern. In this paper we assume that the pattern can be scaled. We propose a new par...
متن کاملOptimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
All algorithms below are optimal alphabet-independent parallel CRCW PRAM algorithms. In one dimension: Given a pattern string of length m for the string-matching problem, we design an algorithm that computes a deterministic sample of a suu-ciently long substring in constant time. This problem used to be a bottleneck in the pattern preprocessing for one-and two-dimensional pattern matching. The ...
متن کاملParallel Bi-dimensional Pattern Matching with Scaling
This paper deals with the problem of bi-dimensional pattern matching with scaling. The problem is to find all occurrences of the m m pattern in the N N text, scaled to all natural multiples. We have proposed an efficient parallel algorithm for this problem on CREW-PRAM with p2 processors. It takes O(N2 p2 ) time.
متن کامل